Steiner tree
英 [ˈstaɪnə triː]
美 [ˈstaɪnər triː]
网络 斯坦纳树; 斯坦立树; 立树; 史坦纳树; 斯坦利树
双语例句
- Study on Location-selection of Logistics Distribution Center Based on GIS and Steiner Tree Problem
基于GIS与Steiner树问题的物流配送中心选址研究 - Location Problem of Junction Logistic Center Based on Optimal Weighted Steiner Tree
基于最优加权Steiner树的枢纽型物流中心选址问题 - An Algorithm for Interconnection of NoC Based on Rectilinear Steiner Tree
基于直角Steiner树的片上网络互连算法 - Based on the models of minimum risk sum and minimum maximum risk, this paper is concerned with the minimum Steiner tree problems in uncertain networks with interval data.
考虑了在带区间数据的不确定网络中，最小风险和模型以及最小最大风险模型下的斯坦纳树问题。 - Inverse Bottleneck Steiner Tree Problem Under Norm
基于范数下的反瓶颈Steiner树问题 - Algorithm for Delay-constrained Steiner Tree Based on Local Domain Information
基于本地域信息的时延约束Steiner树算法 - Ant algorithm for optimal weighted Steiner tree and its application in location allocation based on the concept of electronic potential
基于电势的最优加权Steiner树蚂蚁算法及其选址应用 - Study on Location-selection of Extended Steiner Tree Problem
扩展Steiner树问题的选址应用研究 - The Steiner tree problem on graph and its heuristic algorithm
图上STEINER树问题及其近似算法 - Approximation algorithm for Steiner tree problem
Steiner树问题的近似算法 - In this paper, we extened the famous Steiner tree problems on a plan to n-dimensional Euclidean space E n, and obtain some important properties of Steiner point in the simplex and some weighed geometric inequalities.
将平面上著名的Steiner树问题推广到n维欧氏空间En中，得到了单形中Steiner点的一些重要性质以及一些加权几何不等式。 - The full Steiner tree problem ( TST) is to find a minimum weight Steiner tree with all the vertices of its leaves.
满Steiner树问题（TST）是求解一个正则点都是叶子的最小Steiner树问题。 - In this thesis, firstly, the existing heuristic algorithms for Steiner tree problem are summarized;
本论文首先对无约束多播问题，即最优Steiner树问题的启发式算法进行了总结； - The Properties and Extrema of Steiner Tree in E~ n Space
E~n空间中Steiner树的性质与极值 - Solution for Steiner tree problem based on Elmore model
基于Elmore模型的Steiner树问题的求解 - This paper presents a polynomial algorithm to determine whether a threshold graph is a Hamiltonian graph. It is also shown that STEINER tree problem in threshold graph is NP-complete and a polynomial approximate algorithm for it is proposed.
本文给出了判定阈图是否为哈密顿图的多项式时间算法，并证明了阈图上STEINER树问题是NP-完全的，给出解答它的多项式时间近似算法。 - Searching Steiner tree is important for optimizing the multicast routing in communication networks, which is proved to be NP complete.
求解Steiner树对通信网络点对多点路由优化问题有重要意义，已被证明是NP-complete的。 - Improved Approximation Algorithm for Steiner Tree Based on Topology Analysis
改进的基于拓扑分析的Steiner树近似算法 - Minimum Steiner tree problem is NP complete problem. There are theoretic and realistic significance to research heuristic for Steiner problem.
最小Steiner树问题是NP完全问题，关于Steiner问题的启发式算法的研究具有重要理论和实际意义。 - The existing heuristic algorithms for Steiner tree problem are summarized.
综述了最优Steiner树问题及其常用的启发式算法。 - Timing Driven Steiner Tree Algorithm Based on Sakurai Model
基于Sakurai模型的时延驱动Steiner树算法 - A genetic algorithm of the Steiner tree problem is given.
建立了一种求解基于Elmore延迟模型的Steiner树问题的遗传算法。 - Firstly, We present a genetic algorithm for the incidence coloring on graphs and Steiner tree problem.
首先给出了图的关联着色和文件传输问题的遗传算法。 - This paper presents a mixed genetic algorithm of Timing-Driven Rectilinear Steiner Tree ( RCST-GA).
文章提出一个关于延迟驱动的矩形边斯坦纳树（简称RCST）的混合遗传算法（RCST－GA）。 - At first, this thesis introduces the VLSI physical design process, based on this leads to the rectilinear Steiner tree problem.
本文首先介绍了超大规模集成电路的物理设计流程，在此基础上引出直角斯坦纳树问题。 - System global shortest path is one of the classic nonlinear combinatorial optimization problems. The minimum Steiner tree theory is the basis theory of shortest path, and designing effective algorithms for it has important theoretical significance and wide application value.
系统全局最短路径是非线性组合优化中的经典问题之一，对该问题的理论基础&最小Steiner树设计有效的算法具有重要的理论意义和广泛的应用价值。 - Steiner tree multicast as a classic NP-hard problem cannot find the optimal solution in polynomial time.
Steiner树作为组播的经典NP问题，无法在多项式时间内找到最优解。 - Steiner tree problem is a classical problem in combinatorial optimization, it has been broadly used and deeply developed in many fields.
Steiner树问题是组合优化中的一个经典问题，它在很多领域得到了广泛应用和深入发展。 - The research of algorithms design and analysis of network optimization problem, such as the shortest paths of network, the smallest cost spanning trees, the smallest cost flows, Steiner tree and so on, has become an important research aspect of computer science.
研究网络优化问题，如网络的最短路问题、最小费用支撑树问题、最小费用流问题及Steiner树问题等的算法设计与分析，已成为多个学科的一个重要研究方向。